Ketan Mulmuley

Ketan Mulmuley is a professor in the Department of Computer Science at the University of Chicago, and a sometime visiting professor at IIT Bombay.^[1] He specializes in theoretical computer science, especially computational complexity theory, and in recent years has been working on "geometric complexity theory", an approach to the P versus NP problem through the techniques of algebraic geometry, with Milind Sohoni of IIT Bombay ^[2]. He is also known for his result with Umesh Vazirani and Vijay Vazirani that showed that "Matching is as easy as matrix inversion",^[3] in a paper that introduced the isolation lemma.^[4]

He earned his PhD in computer science from Carnegie Mellon University^[1] in 1985 under Dana Scott, winning the 1986 ACM Doctoral Dissertation Award for his thesis Full Abstraction and Semantic Equivalence.^[5] He also won a Miller fellowship at the University of California, Berkeley for 1985–1987, and a Guggenheim Foundation Fellowship for the year 1999–2000.^[1]

Books

• Ketan Mulmuley (1985), Full abstraction and semantic equivalence, MIT Press, ISBN 9780262132275, http://books.google.com/?id=XLqhQgAACAAJ 
• Ketan Mulmuley (1994), Computational geometry: an introduction through randomized algorithms, Prentice-Hall, ISBN 9780133363630, http://books.google.com/?id=rjgZAQAAIAAJ 

References

1. ^ ^{a b c} Page at IIT Bombay (visiting professor)
2. ^ Lance Fortnow, "Status of the P vs NP Problem", CACM, September 2009
3. ^ Mulmuley, K.; U. V Vazirani, V. V Vazirani (1987), "Matching is as easy as matrix inversion", Combinatorica 7 (1): 105–113, doi:10.1007/BF02579206, http://www.springerlink.com/content/r4rw2x4l46476708/.  STOC version: doi:10.1145/28395.383347
4. ^ The Isolation Lemma and Beyond, by Richard J. Lipton
5. ^ ACM Award citation

External links

• Faculty page
• List of recent publications
• Ketan Mulmuley at the Mathematics Genealogy Project.